Synchronizing the Smallest Possible System

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanisms for generating and compensating for the smallest possible saccades.

Microsaccades are small eye movements that occur during gaze fixation. Although taking place only when we attempt to stabilize gaze position, microsaccades can be understood by relating them to the larger voluntary saccades, which abruptly shift gaze position. Starting from this approach to microsaccade analysis, I show how it can lead to significant insight about the generation and functional ...

متن کامل

How small can thermal machines be? The smallest possible refrigerator.

We investigate the fundamental dimensional limits to thermodynamic machines. In particular, we show that it is possible to construct self-contained refrigerators (i.e., not requiring external sources of work) consisting of only a small number of qubits and/or qutrits. We present three different models, consisting of two qubits, a qubit and a qutrit with nearest-neighbor interactions, and a sing...

متن کامل

The Smallest Possible Interaction Radius for Flock Synchronization

This paper investigates the synchronization behavior of a class of flocks modeled by the nearest neighbor rules. While connectivity of the associated dynamical neighbor graphs is crucial for synchronization, it is well known that the verification of such dynamical connectivity is the core of theoretical analysis. Ideally, conditions used for synchronization should be imposed on the model parame...

متن کامل

Uller Spaces to Have Smallest Possible Inner Radii

If fR n g 1 n=1 is a sequence of hyperbolic Riemann surfaces such that for any r > 0 a hyperbolic ball of radius r embeds isometrically into R n for all n suuciently large, then as n ! 1 the inner radii of the associated Teichm uller spaces i(T(R n)) ! 2. A straightforward consequence of this is that if a Riemann surface R contains arbitrarily large hyperbolic balls then i(T(R)) = 2. Let ? be a...

متن کامل

NP-Completeness of Searches for Smallest Possible Feature Sets

Scott Davies and Stuart Russell Computer Science Division University of California Berkeley, CA 94720 fsdavies,[email protected] Abstract In many learning problems, the learning system is presented with values for features that are actually irrelevant to the concept it is trying to learn. The FOCUS algorithm, due to Almuallim and Dietterich, performs an explicit search for the smallest p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2018

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.121.053601